Alphabetic Minimax Trees of Degree at Most t
نویسندگان
چکیده
منابع مشابه
Alphabetic Minimax Trees of Degree at Most t
Problems in circuit fan-out reduction motivate the study of constructing various types of weighted trees that are optimal with respect to maximum weighted path length. An upper bound on the maximum weighted path length and an efficient construction algorithm will be presented for trees of degree at most t, along with their implications for circuit fan-out reduction. Key words, optimal weighted ...
متن کاملAlphabetic Minimax Trees in Linear Time
We develop a linear time algorithm algorithm for the following problem: given an ordered sequence of n real weights w1, w2, . . . , wn, construct a binary tree on n leaves labeled with those weights when read from left to right so that the maximum value of wi plus depth of the i-th leftmost leaf is minimized. This improves the previously known O(n logn) time solutions [2,11,13]. We also give a ...
متن کاملA New Algorithm for Building Alphabetic Minimax Trees
We show how to build an alphabetic minimax tree for a sequence W = w1, . . . , wn of real weights in O(nd log logn) time, where d is the number of distinct integers ⌈wi⌉. We apply this algorithm to building an alphabetic prefix code given a sample.
متن کاملOptimal Alphabetic Trees
An algorithm of Knuth for finding an optimal binary tree is extended in several directions to solve related problems. The first case considered is restricting the depth of the tree by some predetermined integer K, and a Kn algorithm is given. Next, for trees of degree tr, rather than binary trees, Kn log tr and n log tr algorithms are found for the restricted and nonrestricted cases, respective...
متن کاملOptimal Alphabetic Ternary Trees
We give a new algorithm to construct optimal alphabetic ternary trees, where every internal node has at most three children. This algorithm generalizes the classic Hu-Tucker algorithm, though the overall computational complexity has yet to be determined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1986
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0215013